Symbolic Reachability Computation for Families of Linear Vector Fields

Symbolic Reachability Computation for Families of Linear Vector Fields

Symbolic Reachability Computation for Families of Linear Vector Fields Gerardo Lafferriere Department of Mathematical Sciences Portland State University, P.O. Box 751, Portland, OR 97207-0751. [email protected] George J. Pappas Department of Electrical Engineering University of Pennsylvania, 200 South 33rd Street, Philadelphia, PA 19104. [email protected] Sergio Yovine VERIMAG Centre Equat...

Symbolic computation of reachability

Symbolic Computation of Maximal Probabilistic Reachability

We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of the maximal probability of reaching a given set of states, and underlies decision procedures for the automatic verification of probabilistic systems. We extend the framework of symbolic transition systems, which equips...

Symbolic Computation of Minimal Probabilistic Reachability∗

This paper continues our study of the verification problem for infinitestate systems featuring both nondeterministic and probabilistic choice. In an earlier paper we defined symbolic probabilistic systems, an extension of the framework of symbolic transition systems due to Henzinger et. al., and considered the problem of deciding the maximal probability of reaching a set of target states. A sym...

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...